0.04/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.12	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.12/0.33	% Computer : n008.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1920
0.12/0.33	% WCLimit    : 240
0.12/0.33	% DateTime   : Wed Jul 30 04:33:04 EDT 2025
0.12/0.33	% CPUTime    : 
0.19/0.47	Running higher-order theorem proving
0.19/0.48	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.vXMg5xmZoA/E---3.1_28686.p
0.19/0.49	# Version: 3.0.0-ho
0.19/0.49	# Preprocessing class: HSSSSLSSSLSNSFN.
0.19/0.49	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.19/0.49	# Starting new_ho_10 with 1200s (5) cores
0.19/0.49	# Starting ehoh_best_sine_rwall with 240s (1) cores
0.19/0.49	# Starting lpo1_def_fix with 240s (1) cores
0.19/0.49	# Starting ehoh_best8_lambda with 240s (1) cores
0.19/0.49	# ehoh_best_sine_rwall with pid 28765 completed with status 0
0.19/0.49	# Result found by ehoh_best_sine_rwall
0.19/0.49	# Preprocessing class: HSSSSLSSSLSNSFN.
0.19/0.49	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.19/0.49	# Starting new_ho_10 with 1200s (5) cores
0.19/0.49	# Starting ehoh_best_sine_rwall with 240s (1) cores
0.19/0.49	# SinE strategy is gf500_gu_R04_F100_L20000
0.19/0.49	# Search class: HGUSF-FFSF22-MSFFMFNN
0.19/0.49	# partial match(1): HGUSF-FFSF22-SSFFMFNN
0.19/0.49	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.19/0.49	# Starting new_ho_10 with 130s (1) cores
0.19/0.49	# new_ho_10 with pid 28768 completed with status 0
0.19/0.49	# Result found by new_ho_10
0.19/0.49	# Preprocessing class: HSSSSLSSSLSNSFN.
0.19/0.49	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.19/0.49	# Starting new_ho_10 with 1200s (5) cores
0.19/0.49	# Starting ehoh_best_sine_rwall with 240s (1) cores
0.19/0.49	# SinE strategy is gf500_gu_R04_F100_L20000
0.19/0.49	# Search class: HGUSF-FFSF22-MSFFMFNN
0.19/0.49	# partial match(1): HGUSF-FFSF22-SSFFMFNN
0.19/0.49	# Scheduled 6 strats onto 1 cores with 240 seconds (240 total)
0.19/0.49	# Starting new_ho_10 with 130s (1) cores
0.19/0.49	# Preprocessing time       : 0.001 s
0.19/0.49	# Presaturation interreduction done
0.19/0.49	
0.19/0.49	# Proof found!
0.19/0.49	# SZS status Theorem
0.19/0.49	# SZS output start CNFRefutation
0.19/0.49	thf(decl_23, type, in: $i > $i > $o).
0.19/0.49	thf(decl_24, type, dsetconstr: $i > ($i > $o) > $i).
0.19/0.49	thf(decl_25, type, subset: $i > $i > $o).
0.19/0.49	thf(decl_26, type, subsetI1: $o).
0.19/0.49	thf(decl_27, type, subsetE: $o).
0.19/0.49	thf(decl_28, type, setextsub: $o).
0.19/0.49	thf(decl_29, type, binintersect: $i > $i > $i).
0.19/0.49	thf(decl_30, type, binintersectI: $o).
0.19/0.49	thf(decl_31, type, binintersectLsub: $o).
0.19/0.49	thf(decl_32, type, esk1_2: $i > $i > $i).
0.19/0.49	thf(decl_33, type, esk2_0: $i).
0.19/0.49	thf(decl_34, type, esk3_0: $i).
0.19/0.49	thf(binintersect, axiom, ((binintersect)=(^[X1:$i, X2:$i]:(dsetconstr @ X1 @ (^[X3:$i]:((in @ X3 @ X2)))))), file('/export/starexec/sandbox/tmp/tmp.vXMg5xmZoA/E---3.1_28686.p', binintersect)).
0.19/0.49	thf(binintersectI, axiom, ((binintersectI)<=>![X1:$i, X2:$i, X3:$i]:(((in @ X3 @ X1)=>((in @ X3 @ X2)=>(in @ X3 @ (binintersect @ X1 @ X2)))))), file('/export/starexec/sandbox/tmp/tmp.vXMg5xmZoA/E---3.1_28686.p', binintersectI)).
0.19/0.49	thf(binintersectLsub, axiom, ((binintersectLsub)<=>![X1:$i, X2:$i]:((subset @ (binintersect @ X1 @ X2) @ X1))), file('/export/starexec/sandbox/tmp/tmp.vXMg5xmZoA/E---3.1_28686.p', binintersectLsub)).
0.19/0.49	thf(binintersectSubset2, conjecture, (((subsetE)=>((setextsub)=>((binintersectI)=>(![X1:$i, X2:$i]:(((subset @ X1 @ X2)=>((binintersect @ X1 @ X2)=(X1))))<=(binintersectLsub)))))<=(subsetI1)), file('/export/starexec/sandbox/tmp/tmp.vXMg5xmZoA/E---3.1_28686.p', binintersectSubset2)).
0.19/0.49	thf(subsetI1, axiom, ((subsetI1)<=>![X1:$i, X2:$i]:((![X3:$i]:(((in @ X3 @ X1)=>(in @ X3 @ X2)))=>(subset @ X1 @ X2)))), file('/export/starexec/sandbox/tmp/tmp.vXMg5xmZoA/E---3.1_28686.p', subsetI1)).
0.19/0.49	thf(setextsub, axiom, ((setextsub)<=>![X1:$i, X2:$i]:(((subset @ X1 @ X2)=>((subset @ X2 @ X1)=>((X1)=(X2)))))), file('/export/starexec/sandbox/tmp/tmp.vXMg5xmZoA/E---3.1_28686.p', setextsub)).
0.19/0.49	thf(subsetE, axiom, ((subsetE)<=>![X1:$i, X2:$i, X3:$i]:(((subset @ X1 @ X2)=>((in @ X3 @ X1)=>(in @ X3 @ X2))))), file('/export/starexec/sandbox/tmp/tmp.vXMg5xmZoA/E---3.1_28686.p', subsetE)).
0.19/0.49	thf(c_0_7, plain, ((binintersect)=(^[Z0/* 19 */:$i, Z1:$i]:(dsetconstr @ Z0 @ (^[Z2/* 3 */:$i]:((in @ Z2 @ Z1)))))), inference(fof_simplification,[status(thm)],[binintersect])).
0.19/0.49	thf(c_0_8, axiom, ((binintersectI)=(![X1:$i, X2:$i, X3:$i]:(((in @ X3 @ X1)=>((in @ X3 @ X2)=>(in @ X3 @ (dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ X2)))))))))), inference(apply_def,[status(thm)],[binintersectI, c_0_7])).
0.19/0.49	thf(c_0_9, axiom, ((binintersectLsub)=(![X1:$i, X2:$i]:((subset @ (dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ X2)))) @ X1)))), inference(apply_def,[status(thm)],[binintersectLsub, c_0_7])).
0.19/0.49	thf(c_0_10, negated_conjecture, ~((![X29:$i, X30:$i]:((![X31:$i]:(((in @ X31 @ X29)=>(in @ X31 @ X30)))=>(subset @ X29 @ X30)))=>(![X19:$i, X20:$i, X21:$i]:(((subset @ X19 @ X20)=>((in @ X21 @ X19)=>(in @ X21 @ X20))))=>(![X22:$i, X23:$i]:(((subset @ X22 @ X23)=>((subset @ X23 @ X22)=>((X22)=(X23)))))=>(![X24:$i, X25:$i, X26:$i]:(((in @ X26 @ X24)=>((in @ X26 @ X25)=>(in @ X26 @ (dsetconstr @ X24 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ X25))))))))=>(![X27:$i, X28:$i]:((subset @ (dsetconstr @ X27 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ X28)))) @ X27))=>![X1:$i, X2:$i]:(((subset @ X1 @ X2)=>((dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ X2))))=(X1)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[binintersectSubset2]), subsetI1]), c_0_8]), c_0_7]), c_0_9]), setextsub]), subsetE])])).
0.19/0.49	thf(c_0_11, negated_conjecture, ![X32:$i, X33:$i, X35:$i, X36:$i, X37:$i, X38:$i, X39:$i, X40:$i, X41:$i, X42:$i, X43:$i, X44:$i]:(((((in @ (esk1_2 @ X32 @ X33) @ X32)|(subset @ X32 @ X33))&(~(in @ (esk1_2 @ X32 @ X33) @ X33)|(subset @ X32 @ X33)))&((~(subset @ X35 @ X36)|(~(in @ X37 @ X35)|(in @ X37 @ X36)))&((~(subset @ X38 @ X39)|(~(subset @ X39 @ X38)|((X38)=(X39))))&((~(in @ X42 @ X40)|(~(in @ X42 @ X41)|(in @ X42 @ (dsetconstr @ X40 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ X41)))))))&((subset @ (dsetconstr @ X43 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ X44)))) @ X43)&((subset @ esk2_0 @ esk3_0)&((dsetconstr @ esk2_0 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ esk3_0))))!=(esk2_0))))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])])).
0.19/0.49	thf(c_0_12, negated_conjecture, ![X1:$i, X2:$i]:(((subset @ X1 @ X2)|~((in @ (esk1_2 @ X1 @ X2) @ X2)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.19/0.49	thf(c_0_13, negated_conjecture, ![X1:$i, X2:$i, X3:$i]:(((in @ X1 @ (dsetconstr @ X2 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ X3)))))|~((in @ X1 @ X2))|~((in @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.19/0.49	thf(c_0_14, negated_conjecture, ![X3:$i, X2:$i, X1:$i]:(((in @ X3 @ X2)|~((subset @ X1 @ X2))|~((in @ X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.19/0.49	thf(c_0_15, negated_conjecture, (subset @ esk2_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_11])).
0.19/0.49	thf(c_0_16, negated_conjecture, ![X1:$i, X3:$i, X2:$i]:(((subset @ X1 @ (dsetconstr @ X2 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ X3)))))|~((in @ (esk1_2 @ X1 @ (dsetconstr @ X2 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ X3))))) @ X3))|~((in @ (esk1_2 @ X1 @ (dsetconstr @ X2 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ X3))))) @ X2)))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
0.19/0.49	thf(c_0_17, negated_conjecture, ![X1:$i]:(((in @ X1 @ esk3_0)|~((in @ X1 @ esk2_0)))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.19/0.49	thf(c_0_18, negated_conjecture, ![X1:$i, X2:$i]:(((subset @ X1 @ (dsetconstr @ X2 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ esk3_0)))))|~((in @ (esk1_2 @ X1 @ (dsetconstr @ X2 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ esk3_0))))) @ esk2_0))|~((in @ (esk1_2 @ X1 @ (dsetconstr @ X2 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ esk3_0))))) @ X2)))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
0.19/0.49	thf(c_0_19, negated_conjecture, ![X1:$i, X2:$i]:(((in @ (esk1_2 @ X1 @ X2) @ X1)|(subset @ X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.19/0.49	thf(c_0_20, negated_conjecture, ![X1:$i]:(((subset @ esk2_0 @ (dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ esk3_0)))))|~((in @ (esk1_2 @ esk2_0 @ (dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ esk3_0))))) @ X1)))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.19/0.49	thf(c_0_21, negated_conjecture, ![X2:$i, X1:$i]:((((X1)=(X2))|~((subset @ X1 @ X2))|~((subset @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.19/0.49	thf(c_0_22, negated_conjecture, (subset @ esk2_0 @ (dsetconstr @ esk2_0 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ esk3_0))))), inference(spm,[status(thm)],[c_0_20, c_0_19])).
0.19/0.49	thf(c_0_23, negated_conjecture, ![X2:$i, X1:$i]:((subset @ (dsetconstr @ X1 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ X2)))) @ X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.19/0.49	thf(c_0_24, negated_conjecture, ((dsetconstr @ esk2_0 @ (^[Z0/* 3 */:$i]:((in @ Z0 @ esk3_0))))!=(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
0.19/0.49	thf(c_0_25, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23])]), c_0_24]), ['proof']).
0.19/0.49	# SZS output end CNFRefutation
0.19/0.49	# Parsed axioms                        : 16
0.19/0.49	# Removed by relevancy pruning/SinE    : 9
0.19/0.49	# Initial clauses                      : 8
0.19/0.49	# Removed in clause preprocessing      : 0
0.19/0.49	# Initial clauses in saturation        : 8
0.19/0.49	# Processed clauses                    : 34
0.19/0.49	# ...of these trivial                  : 0
0.19/0.49	# ...subsumed                          : 0
0.19/0.49	# ...remaining for further processing  : 34
0.19/0.49	# Other redundant clauses eliminated   : 0
0.19/0.49	# Clauses deleted for lack of memory   : 0
0.19/0.49	# Backward-subsumed                    : 0
0.19/0.49	# Backward-rewritten                   : 1
0.19/0.49	# Generated clauses                    : 58
0.19/0.49	# ...of the previous two non-redundant : 42
0.19/0.49	# ...aggressively subsumed             : 0
0.19/0.49	# Contextual simplify-reflections      : 0
0.19/0.49	# Paramodulations                      : 58
0.19/0.49	# Factorizations                       : 0
0.19/0.49	# NegExts                              : 0
0.19/0.49	# Equation resolutions                 : 0
0.19/0.49	# Disequality decompositions           : 0
0.19/0.49	# Total rewrite steps                  : 15
0.19/0.49	# ...of those cached                   : 6
0.19/0.49	# Propositional unsat checks           : 0
0.19/0.49	#    Propositional check models        : 0
0.19/0.49	#    Propositional check unsatisfiable : 0
0.19/0.49	#    Propositional clauses             : 0
0.19/0.49	#    Propositional clauses after purity: 0
0.19/0.49	#    Propositional unsat core size     : 0
0.19/0.49	#    Propositional preprocessing time  : 0.000
0.19/0.49	#    Propositional encoding time       : 0.000
0.19/0.49	#    Propositional solver time         : 0.000
0.19/0.49	#    Success case prop preproc time    : 0.000
0.19/0.49	#    Success case prop encoding time   : 0.000
0.19/0.49	#    Success case prop solver time     : 0.000
0.19/0.49	# Current number of processed clauses  : 25
0.19/0.49	#    Positive orientable unit clauses  : 6
0.19/0.49	#    Positive unorientable unit clauses: 0
0.19/0.49	#    Negative unit clauses             : 1
0.19/0.49	#    Non-unit-clauses                  : 18
0.19/0.49	# Current number of unprocessed clauses: 24
0.19/0.49	# ...number of literals in the above   : 58
0.19/0.49	# Current number of archived formulas  : 0
0.19/0.49	# Current number of archived clauses   : 9
0.19/0.49	# Clause-clause subsumption calls (NU) : 107
0.19/0.49	# Rec. Clause-clause subsumption calls : 98
0.19/0.49	# Non-unit clause-clause subsumptions  : 0
0.19/0.49	# Unit Clause-clause subsumption calls : 8
0.19/0.49	# Rewrite failures with RHS unbound    : 0
0.19/0.49	# BW rewrite match attempts            : 14
0.19/0.49	# BW rewrite match successes           : 1
0.19/0.49	# Condensation attempts                : 34
0.19/0.49	# Condensation successes               : 0
0.19/0.49	# Termbank termtop insertions          : 2788
0.19/0.49	# Search garbage collected termcells   : 413
0.19/0.49	
0.19/0.49	# -------------------------------------------------
0.19/0.49	# User time                : 0.005 s
0.19/0.49	# System time              : 0.005 s
0.19/0.49	# Total time               : 0.010 s
0.19/0.49	# Maximum resident set size: 1936 pages
0.19/0.49	
0.19/0.49	# -------------------------------------------------
0.19/0.49	# User time                : 0.005 s
0.19/0.49	# System time              : 0.008 s
0.19/0.49	# Total time               : 0.013 s
0.19/0.49	# Maximum resident set size: 1720 pages
0.19/0.49	% E exiting
0.19/0.50	% E exiting
0.19/0.50	EOF